An upper bound on the fluctuations of a second class particle
نویسنده
چکیده
This note proves an upper bound for the fluctuations of a second-class particle in the totally asymmetric simple exclusion process. The proof needs a lower tail estimate for the last-passage growth model associated with the exclusion process. A stronger estimate has been proved for the corresponding discrete time model, but not for the continuous time model we work with. So we take the needed estimate as a hypothesis. The process is assumed to be initially in local equilibrium with a slowly varying macroscopic profile. The macroscopic initial profile is smooth in a neighborhood of the origin where the second-class particle starts off, and the forward characteristic from the origin is not a shock. Given these assumptions, the result is that the typical fluctuation of the second-class particle is not of larger order than n2/3(log n)1/3, where n is the ratio of the macroscopic and microscopic space scales. The conjectured correct order should be n2/3. Landim et al. have proved a lower bound of order n5/8 for more general asymmetric exclusion processes in equilibrium. Fluctuations in the case of shocks and rarefaction fans are covered by earlier results of Ferrari–Fontes and Ferrari–Kipnis. Research partially supported by NSF grant DMS-0126775.
منابع مشابه
An upper bound to the second Hankel functional for the class of gamma-starlike functions
The objective of this paper is to obtain an upper bound to the second Hankel determinant $|a_{2}a_{4}-a_{3}^{2}|$ for the function $f$, belonging to the class of Gamma-starlike functions, using Toeplitz determinants. The result presented here include two known results as their special cases.
متن کاملAn Upper Bound on the First Zagreb Index in Trees
In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.
متن کاملOn trees attaining an upper bound on the total domination number
A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$. The total domination number of a graph $G$, denoted by $gamma_t(G)$, is~the minimum cardinality of a total dominating set of $G$. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International ournal of Graphs and Combinatorics 1 (2004), 6...
متن کاملAn Upper Bound Approach for Analysis of Hydroforming of Sheet Metals
Considering a kinematical velocity admissible field, the upper bound method has beenused for predicting the amount of pressure in hydroforming of sheet metals. The effects of workhardening, friction and blank size have been considered in pressure prediction. Also the effect ofsheet thickness variation has been considered in the present work formulations. The relation betweenpressure and punch s...
متن کامل